Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
291	University of Potsdam Faculty of Computer Science Add to Reading List Source URL: www.cs.uni-potsdam.de Language: English - Date: 2006-05-02 04:55:54 Automated theorem proving Constraint programming Boolean algebra Rules of inference Logic programming Boolean satisfiability problem Directed acyclic graph Resolution Clause Theoretical computer science Mathematics Mathematical logic
292	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
293	Careful Ranking of Multiple Solvers with Timeouts and Ties Allen Van Gelder Add to Reading List Source URL: users.soe.ucsc.edu Language: English - Date: 2011-04-08 00:56:54 Numerical software NP-complete problems Electronic design automation Formal methods Logic in computer science Boolean satisfiability problem Solver Lis Fridrich Method Theoretical computer science Software Mathematics
294	A Survey of 3sum-Hard Problems James King [removed] Add to Reading List Source URL: www.cs.mcgill.ca Language: English - Date: 2004-12-20 06:07:32 3SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory
295	4 COMPUTATIONAL MODAL LOGIC Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2007-07-26 07:53:15 Modal logic Philosophical logic Predicate logic Metalogic First-order logic Interpretation Satisfiability Admissible rule Boolean satisfiability problem Logic Mathematical logic Model theory
296	Ranking and Reputation Systems in the QBF competition Massimo Narizzano, Luca Pulina, and Armando Tacchella Add to Reading List Source URL: www.star.dist.unige.it Language: English - Date: 2007-12-12 09:04:58 Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Satisfiability Modulo Theories Solver True quantified Boolean formula Theoretical computer science Applied mathematics Mathematics
297	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
298	Theory of Computation Chapter 9 Guan-Shieng Huang Add to Reading List Source URL: staffweb.ncnu.edu.tw Language: English - Date: 2004-02-15 23:56:23 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation 2-satisfiability NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
299	P = NP Vinay Deolalikar HP Research Labs, Palo Alto Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2010-08-08 08:45:30 Complexity classes Mathematical optimization Finite model theory Statistical models Graphical model P versus NP problem Markov random field Boolean satisfiability problem NP Theoretical computer science Computational complexity theory Applied mathematics
300	Constraint Satisfaction: A Personal Perspective Tom´as Feder 268 Waverley St., Palo Alto, CA 94301, USA Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2006-02-09 15:48:02 Complexity classes Constraint satisfaction P versus NP problem NP-complete NP P Boolean satisfiability problem 2-satisfiability Oracle machine Theoretical computer science Computational complexity theory Applied mathematics

UPDATE